Segmentation tag cleanup based on connected components

ABSTRACT

A method of cleaning segmentation tags is disclosed. A method in accordance with the present invention receives a set of segmentation tags and identifies a connected component within the received segmentation tags. The connected component comprising segmentation tags of preselected image types. The method further includes compiling statistics for the connected component and generating a representative tag for the connected component based upon the compiled statistics. A system in accordance the present invention comprises a tag analysis module connected to receive segmentation tags and identify weakly connected segmentation tags within said received segmentation tags; a connected component generator identifying a connected component within the received segmentation tags and a tag generation module generating a representative tag for the connected component.

CROSS REFERENCE

Cross reference is made to the following related applications “BlockLevel Analysis of Segmentation Tags” by R. Nagarajan et al., U.S. patentapplication Ser. No. 09/392,902; “Segmentation Tag Cleanup System” by R.Nagarajan et al., U.S. patent application Ser. No. 09/393,094;“Segmentation Tag Cleanup Using Neighborhood Tags” by R. Nagarajan etal., U.S. patent application Ser. No. 09/393,008; and “Pixel LevelSegmentation Tag Cleanup” by X. Li et al., U.S. patent application Ser.No. 09/393,080.

BACKGROUND OF THE INVENTION

The present invention relates to a system and method for processingsegmentation tags, and more particularly, to a system and method toclean segmentation tags to reduce artifacts resulting frommisclassification and abrupt changes in image classification.

In the reproduction or display of images from image data, and moreparticularly, to the rendering of image data representing originaldocument that has been electronically scanned, one is faced with thelimited resolution capabilities of the rendering system. An imageprocessing system may be tailored so as to offset the limitations of therendering system; however, this tailoring is difficult due to thedivergent processing needs required by different image types.

Optimizing the system for one common image type typically comes at theexpense of degraded rendering of other image types. For example,optimizing the system for low frequency halftones often comes at theexpense of degraded rendering of high frequency halftones or text/lineart, and visa versa. In view of this, optimizing the image processingsystem for one image type in an effort to offset the limitations in theresolution and the depth capability of the rendering apparatus may notbe possible, requiring a compromised choice which may not produceacceptable results. Further complicating the reproduction of originaldocuments is the reality that a document may be comprised of multipleimage types (image classes), including continuous tones (contones),halftones of various frequencies, text/line art, error diffused images,etc.

To address this situation, digital reproduction devices often useautomatic image segmentation techniques. Auto-segmentation is a wellknown operation that may use any of a number of classification functions(e.g., auto-correlation, frequency analysis, pattern or templatematching, peak/valley detection, histograms, etc.) to analyze videoimage data and classify image pixels as one of several possible imageclasses. A typical auto-segmentation process generates a pixelclassification signal, known as a segmentation tag, that identifies thepixel as a particular image class. Some common image types (imageclasses) include smooth contone, rough contone, text, text on tint, lowfrequency halftone, high frequency halftone, various intermediatefrequency halftones which may be implemented as fuzzy frequencies,background and edge.

A one-pass digital reprographic system (scanning and printing done in asingle pass of the image) gets just one chance to analyze and classifyeach pixel of an image based on a few scanlines of neighboring data. Dueto the limited context for classification often one-pass segmentationresults in erroneous switching between categories and since differentcategories require different type of rendering, any misclassificationresults in segmentation defects on the final rendered image.Conventional segmentation techniques base classification decisions oninformation gathered over context of several pixels from a few scanlinesof neighboring data, effectively causing the image data to be lowpassfiltered. The resulting classification decisions change from one classof imagery to another causing abrupt changes in the wrong places. Thisabrupt decision making, which produces a forced choice among severaldiscrete alternate choices, is a primary reason for the formation ofvisible artifacts in the resulting output image.

Moreover, the classification of real images covers a continuum from wellbelow to well above the transition point or thresholds used to delineateclassifications. There are areas of an image which are, for example,just above a threshold. However, variations in the gathered image datadue to “flaws” in the input video or ripple due to interactions betweenareas used for classification and periodic structures in the input videoresult in some areas falling below the threshold. This results in adifferent classification that introduces artifacts in the renderedimage.

Several approaches to improve segmentation processes to reduce thesegmentation artifacts resulting from misclassification and/or abruptchanges in image classification have been employed with varying degreesof success. The following references may be found relevant to thepresent disclosure:

U.S. Pat. No. 5,327,262 to Williams which discloses in conjunction withan image segmentation arrangement in which an image is processed with animage type detection arrangement, a morphological filtering operationwhich initially provides a noise removal filter operating an the imagedetection signal to remove noise within an area of the image detectionsignal and subsequently provides a hole filling filter which bridgessmall gaps in the image type detection results.

U.S. Pat. No. 5,765,029 to Schweid et al. discloses a method and systemthat electronically fuzzy classify a pixel belonging to a set of digitalimage data with respect to a membership of the pixel in a plurality ofimage classes. This process determines a fuzzy classification of thepixel and generates an effect tag for the pixel based on the fuzzyclassification determination. Each class is defined by a set ofheuristic rules such that the image classes are non mutually exclusive.

U.S. Pat. No. 5,850,474 to Fan et al. discloses a method and apparatusfor segmenting image data into windows and for classifying the windowsas typical image types which include making two passes through the imagedata. The method includes a step of making a first pass through theimage data to identify windows and to record the beginning points andimage types of each of the windows, and a step of making a second passthrough the image data to label each of the pixels as a particular imagetype.

SUMMARY OF THE INVENTION

In accordance with the present invention, there is provided a method ofcleaning segmentation tags. The method receives a set of segmentationtags and identifies a connected component within the receivedsegmentation tags. The connected component comprising segmentation tagsof preselected image types. The method further includes compilingstatistics for the connected component and generating a representativetag for the connected component based upon the compiled statistics.

In accordance with another aspect of the present invention, there isprovided a system for processing segmentation tags. The system comprisesa tag analysis module connected to receive segmentation tags andidentify weakly connected segmentation tags within said receivedsegmentation tags; a connected component generator identifying aconnected component within the received segmentation tags and a taggeneration module generating a representative tag for the connectedcomponent.

BRIEF DESCRIPTION OF THE DRAWINGS

The following is a brief description of each drawing used to describethe present invention, and thus, are being presented for illustrativepurposes only and should not be limitative to the scope of the presentinvention, wherein like reference numbers represent like devices,circuits, or circuits performing equivalent functions and wherein:

FIG. 1 is a flow chart illustrating various steps in an embodiment of amethod for generating a block level tag;

FIG. 2 schematically illustrates an embodiment of a block tag generatorin accordance with the present invention;

FIG. 3 is a block diagram of an embodiment of a block tag cleaner inaccordance with the present invention;

FIG. 4 illustrates various paths for sequentially stepping through a setof segmentation tags;

FIG. 5 illustrates an exemplary 5×5 neighborhood block employed by anembodiment of the present invention;

FIG. 6 is an exemplary transition block employed by an embodiment of thepresent invention;

FIG. 7 illustrates an embodiment of a block tag cleaning method inaccordance with the present invention;

FIG. 8 schematically illustrates an embodiment of a block tag cleaner inaccordance with the present invention;

FIG. 9 is a block diagram of an embodiment of a pixel tag cleaner inaccordance with the present invention;

FIG. 10 illustrates an neighborhood window of segmentation tags employedby an embodiment of the present invention;

FIG. 11 is a block diagram of an image processing system that includes asystem for processing segmentation tags in accordance with the presentinvention;

FIG. 12 is a block diagram of an embodiment a system for processingsegmentation tags in accordance with the present invention; and

FIG. 13 is a general representation of a suitable system-levelembodiment for one or more aspects of the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT

In accordance with the present invention there is described an apparatusand method for processing segmentation tags. The term “segmentation tag”or “tag” may refer to an electrical or optical signal that identifies orrepresents an image type or image class for a definable area within animage. The following description makes reference to pixel levelsegmentation tags and block level segmentation tags. A “pixel levelsegmentation tag” or “pixel level tag” refers to a segmentation tag foran image pixel. A “block level segmentation tag” or “block level tag”,refers to a segmentation tag that is representative of a plurality ofsegmentation tags. That is, a block level segmentation tag can be arepresentative tag for a plurality of pixel level segmentation tags orfor a plurality of block level segmentation tags.

Turning now to FIG. 13, there is shown an embodiment of a digitalimaging system 200 that incorporates features of the present invention.Digital imaging system 200 includes image source 202 such as a rasterinput scanner or similar image input terminal to provide image data 204to image processing system 206. Image data 204 may be obtained throughline by line scanning of an image bearing the original by one or morephotosensitive elements, such as a multiple photosite array of chargecouple devices commonly referred to as CCDs. Line by line scanning of animage bearing the original for the duration of image data is well knownand does not form a part of the present invention. Although shown as araster input scanner, it is understood that image source 202 maycomprise a computer workstation, a data storage device, a network or anysimilar or equivalent image input terminal to generate image data 204.

Image processing system (IPS) 206 processes the received image data 204to produce print ready data 208 that is supplied to print engine 210. Inresponse to print ready data 208, print engine 210 generates an outputimage on suitable media (e.g., print or display). Although illustratedas an electrophotographic engine, it will become evident from thefollowing discussion that the present invention is useful with a widevariety of output devices such as ink jet, ionographic, thermal, etc.Furthermore, the present invention is not limited in its application tocopying and printing machines and may be incorporated in other outputterminals such as electronic display systems including CRTs, LCDs, LED,etc.

Print engine 210 is shown as operating on print ready data 208 from IPS206 to generate a document in a single pass of a charge retentivesurface in the form of photoreceptor belt 212. Furthermore, print engine210 is shown as comprising a laser based raster output scanning device(ROS) 214 as a light source, although it is to be understood that otherlight sources, for example an LED printbar, might be used. Briefly,photoreceptor 212 is uniformly charged as it passes charging station 216which may comprise, for example, a corona generating device. Theuniformly charged photoreceptor 212 then passes ROS 214 which exposesthe photoreceptor in response to image data from IPS 206 thereby formingan electrostatic latent image on the photoreceptor. The electrostaticlatent image is then developed with toner at developing station 218 toproduce a toner image on belt 212. The toner image is then transferredto a print media (not shown) at a transfer station 220. After transfer,the image is fused to the print media.

It will be apparent to those of ordinary skill in the art that the printengine shown may be modified to generate a color document. For example,by adding successive charging, exposure, and developing stations, arecharge, expose, and develop image on image process can be implementedsuch that the print engine can produce a color document in a single passof the photoreceptor. Similarly, the print engine may comprise a singleROS and several developing stations, each having a different colortoner. With such a system the print engine can produce a color documentusing several passes of the photoreceptor through the ROS and chargingstation wherein each pass is developed at a different developingstation.

The present invention is directed towards aspects of image processingsystem 206 depicted in FIG. 13. In particular, the present invention isdirected to a system for processing of segmentation tags to reducesegmentation artifacts. The present invention proposes a systemcomprising one or more of the three segmentation tag processors, a blocktag generator, a block tag cleaner and a pixel tag cleaner, to processthe segmentation tags. The segmentation tag processors can be used aloneor in combination with either one or both of the other segmentation tagprocessors to reduce the segmentation artifacts.

In general, the block tag generator identifies a block of segmentationtags, compiles statistics for segmentation tags within the identifiedblock and generates a block level tag for the identified block ofsegmentation tags based upon the compiled statistics. The block leveltag identifies a representative segmentation tag or tags for thesegmentation tags within the identified block. The block tag generatorcan operate on either a block of pixel level segmentation tags or ablock of block level segmentation tags.

The block tag cleaner operates to clean segmentation tags based on agroup of neighboring segmentation tags. In a first embodiment, the blocktag cleaner uses morphological operations combined with heuristic rulesto clean segmentation tags based upon blocks of neighboring segmentationtags. More, specifically, after a segmentation tag to be cleaned isidentified, a predefined block of neighboring segmentation tags isidentified. One or more predictions are made from the neighboring tagsand a cleaned tag is generated based upon the predictions.

In a second embodiment of a block tag cleaner, segmentation tags arecleaned by statistically analyzing connected components of segmentationtags. In this embodiment weakly connected segmentation tags areeliminated from a set of segmentation tags and connected components areidentified from the remaining segmentation tags. Tag statistics arecollected for each of the connected components and a representativesegmentation tag is assigned to each connected component based on thecollected statistics and a set of predetermined rules.

The pixel tag cleaner operates on pixel level segmentation tags tomodify pixel level segmentation tags based upon a window of neighboringsegmentation tags. The knowledge of the neighboring segmentation tagsaids in making an intelligent decision regarding the value of a pixellevel tag. Beneficially, the pixel tag cleaner bases the decision tomodify a pixel level tag based on neighboring block level tags such asare available from a block tag generator or a block tag cleaner. Basingthe decision to modify a pixel level tag on neighboring block level tagsavoids “blocky” looking classification and retains the original contoursof the segmentation map. However, it is understood that the pixel tagcleaner may clean pixel level tags based upon a window of neighboringpixel level segmentation tags.

Having briefly described the operation of each of the three segmentationtag processors available for use in a system for processing segmentationtags, attention is now turned to a more detailed discussion of theoperation of each segmentation tag processor. Referring to FIG. 1, thereis shown a flow chart illustrating various steps in the generation of ablock level tag and a representation of the operation of a block taggenerator. As depicted in FIG. 1, the generation of a block level tagbegins at step 10 with the receipt of a segmentation tag. As notedabove, the block tag generator generates a block level tag based uponstatistics for the segmentation tags within the block. To compile thestatistics for a given block, the segmentation tags that comprise theblock of tags must be identified.

The identification of a block of segmentation tags can be accomplishedusing a windowing technique wherein the received segmentation tags arestored in a buffer and, when a sufficient number of segmentation tagshave been stored, a block of tags is selected from the buffer forexamination and compilation of statistics. However, such windowingtechniques can require a large amount of storage for buffering thereceived segmentation tags. To reduce the buffering of segmentationtags, the block tag generator can identify a block of segmentation tagsby assigning segmentation tags to a block as the tags are received. Atstep 12, as the segmentation tags are received, the block tag generatorstores the segmentation tag in its associated block. In general, step 12may store a segmentation tag in a given block using a look-up table, acounter, an address generation circuit or any other similar orequivalent method. Next, as indicated at step 14, the block taggenerator compiles statistics for the segmentation tags within a blockof tags. The statistics compiled at step 14 are used to determine arepresentative segmentation tag, or block level tag, for the block. Asthe segmentation tags are assigned to a block of tags, step 14incorporates the segmentation tag into any previously compiledstatistics for the block of tags to which the segmentation tag isassigned. Beneficially, every segmentation tag within the block isincluded when compiling segmentation tag statistics. However, it shouldbe appreciated that the tag statistics may be compiled from less thanall the segmentation tags. For example, if the hardware and/or softwareperforming the statistics compilation cannot keep up with the data rate,a sub-sampling of the segmentation tags within the block may be used tocompile statistics.

The determination of a block level tag can be based upon any statisticor similar information derived from the segmentation tags within theblock. For example, possible statistics which may be compiled includethe number of occurrences of each different value of segmentation tagwithin the block, the frequency distribution of each of the differentsegmentation tag value, the predominate segmentation tag value, and aweighted count of segmentation tag values. The value of a segmentationtag indicates the image class or image classification that is identifiedor represented by the segmentation tag. It will be appreciated thatthose skilled in the art may recognize alternative statistics may beemployed to generate a block level tag.

At step 16 a determination is made as to whether all the segmentationtags for a given block have been processed. If not, the process loopsback to step 10 to receive more segmentation tags. If a complete blockhas been processed, then a block level tag is generated at step 18.Next, at step 20, the process loops back to step 10 if there are moresegmentation tags to process. The process ends when no furthersegmentation tags need processing.

As described above, a block level tag can be based upon any statisticchosen to be compiled from the segmentation tags. Beneficially, theblock tag generator identifies the predominant tag (Tm) and the secondmost predominant tag (Tm−1) within each block and generates the blocklevel tag based upon those tags. It has been found that providing themost predominant tag (Tm) as the block level tag provides good results.However, it is understood that, based upon the various image classesrepresented by the segmentation tags, it may be advantageous to providea block level tag identifying both Tm and Tm−1 or to generate the blocklevel tag as a function of Tm and Tm−1.

Given a set of segmentation tags comprising the following image classes:smooth contone, rough contone, low frequency halftones, fuzzy (orintermediate) low frequency halftones, fuzzy (or intermediate) highfrequency halftones, high frequency halftones, text, and background,situations arise where it may be advantageous to generate a block leveltag as a function of Tm and Tm−1. For example, it may be appreciatedthat if Tm is a fuzzy or intermediate frequency halftone and Tm−1 is alow frequency or high frequency halftone the block level tag may be setto the second most predominant tag Tm−1 rather than the most predominanttag Tm. One possible set of rules for generating the block level tag(BT) as a function of Tm and Tm−1 given the set of image classes abovecan be described by the following C-like programming statement:

If ((Tm=FUZZY LOW) OR (Tm=FUZZY HIGH))

{

}

else if ((Tm=SMOOTH CONTONE) OR (Tm=HIGH FREQ))

{

if (Tm−1=BACKGROUND) BT=BACKGROUND

}

else if (Tm=ROUGH CONTONE)

{

if (Tm−1=LOW FREQ) BT=LOW FREQ

}

else

{

BT=Tm

}

It is understood that the above set of rules is provided by way ofexample to illustrate the generation of a block level tag as a functionof one or more predominant tags, and one skilled in the art may identifydifferent rules for generating a block level tag. Additionally, theblock tag generator may provide both Tm and Tm−1 which are then used bya block tag cleaner or pixel tag cleaner. Furthermore, it is understoodthat the set of image classes is shown as an example, and one skilled inthe art may retain other combinations of image classes as well as adifferent number of classes.

In summary, the method of generating block level tags illustrated inFIG. 1, begins with the receipt of a segmentation tag at step 10. Atstep 12, the received segmentation tag is assigned to a block of tags.Next, at step 14, the tag is included in statistics compiled for theblock of tags to which the received segmentation tag is assigned. Steps10, 12 and 14 are repeated until statistics have been compiled for allthe selected segmentation tags within a block. When the compilation ofstatistics for a block is completed, the process generates a block leveltag at step 18. The above steps can be repeated until all thesegmentation tags have been received. Beneficially, the block taggeneration process operates on pixel level segmentation tags such as areavailable from an auto-segmentation processor to generate a block leveltag representative of the block of pixel level segmentation tags.However, it is understood that the process represented by FIG. 1 can beused to generate a block level tag representative of a block whichitself comprises block level tags.

Having generally described a method for generating block level tags,attention is now turned to a discussion of an embodiment of a block taggenerator in accordance with the present invention. Referring to FIG. 2,there is shown a block diagram of an embodiment of a block tag generator30. Block tag generator 30 comprises four functional modules: addresscontroller 32, statistics compilation module 34, tag sorting circuit 36and block tag memory 38.

More specifically, statistics compilation module 34 comprises a numberof separate sub-modules (e.g., compilation circuits 34A and 34B), whichreceive segmentation tags. Each compilation circuit 34A and 34B operateson the received segmentation tags to compile statistics for blocks ofsegmentation tags. Address controller 32 which can comprise a moduluscounter, an accumulator, a look-up table, or the like selects theappropriate compilation circuit 34A or 34B within statistics compilationmodule 34 to receive each segmentation tag. The statistics compiled atmodule 34 are coupled to tag sorting circuit 36 where the statistics aresorted on a per block basis and a final block tag is generated. Thefinal block level tag is then written to block tag memory 38 from whichthe block level tags can be retrieved for use by other processors.

The operation of block tag generator 30 of FIG. 2, will be explained infurther detail with reference to the processing of M×N blocks ofsegmentation tags to generate a block level tag based upon a function ofthe most predominant (Tm) and the second most predominant (Tm−1)segmentation tag value within the block. It should be understood thatblock tag generator 30 is not limited to this operation and can be usedto process blocks of varying shapes and/or blocks arranged at any angleand to generate block tags based upon any number of compiled statistics.

In operation, address controller 32 selects one of the computationcircuits, e.g., circuit 34A, to receive tags. Each compilation circuit34A and 34B which may comprise a block of histogram memory, anaccumulator, a counter or the like collects statistics for one row ofblocks. The number of blocks per row depends upon several factorsincluding the values of M and N, the resolution of the segmentationtags, and the size of the input image. For example, using M×N blocks ofpixel level segmentation tags where M and N are selected to be 50 and 75and a scanner with a scan resolution of 400×600 dpi, each row comprises,in the case of a 12.4″×17″ image, approximately 100 blocks(12.4×400/50≈100). After every M segmentation tags, either addressgenerator 32 or compilation circuit 34A indicate that the next tagreceived belongs to a new block. The process repeats for N rows. At theend of N rows, address generator 32 begins coupling the incomingsegmentation tags to compilation circuit 34B.

At the end of N rows, compilation circuit 34A would contain for eachblock in the row a set of statistics that identifies the number ofoccurrences of each tag value within the block. The statistics compiledby circuit 34A are read out by sorting module 36. In sorting module 36,multiplexer 40 routes the statistics to sorter 42 where the statisticsare sorted on a per block basis. Sorter 42 identifies Tm and Tm−1 andgenerates a block level tag based upon a set of rules. The final blocklevel tag for each block is then written to block tag memory 38.

Block tag generator 30 can embody or be implemented using a specialpurpose computer, a programmed microprocessor or microcontroller andperipheral integrated circuit elements, an ASIC or other integratedcircuit, a digital signal processor, a hardwired electronic or logiccircuit such as a discrete element circuit, a programmable logic devicesuch as a PLD, PLA, FPGA or PAL, or the like. Specific algorithms may beaccomplished using software in combination with hardware. In general,any device capable of implementing a finite state machine that iscapable of implementing the block tag generation process described abovecan be used to realize a block tag generator.

Referring now to FIG. 3, there is shown a diagram illustrating the dataflow through a first embodiment of block tag cleaner 50 in accordancewith the present invention. In the embodiment of FIG. 3, segmentationtags are cleaned (processed) by block tag cleaner 50 using morphologicaloperations combined with heuristic rules designed to reduce abruptswitching of tags by discouraging any switching until there is a levelof certainty that a change is needed.

In block tag cleaner 50, segmentation tags are coupled to tagidentification module 52. Optionally, block tag cleaner 50 can includetag buffer (not shown) that receives and buffers the segmentation tags.Tag identification module 52 identifies a current segmentation tag to becleaned. Beneficially, when identifying the current tag to be cleaned,module 52 sequentially steps through successive segmentation tags movingfrom one edge of the image to the opposite edge. For example, FIG. 4illustrates four possible paths (top to bottom, bottom to top, left toright and right to left) to follow when sequentially stepping throughsuccessive segmentation tags to identify the current tag to be cleaned.It should be appreciated that a block tag cleaner is not limited tosequentially stepping through the tags along one of the paths shown inFIG. 4. Furthermore, it should be appreciated that is not even limitedto sequentially stepping through the tags.

After identifying the current segmentation tag to be cleaned, module 52passes the current tag to neighborhood analysis module 54 and transitionanalysis module 56. Neighborhood analysis module 54 retrieves a group ofsegmentation tags neighboring (e.g., adjacent to or near) the currenttag to generate a neighborhood block having a predefined size, shape andlocation relative to the current tag. Beneficially, the neighborhoodblock comprises a square block (i.e., X×X) centered on the current tag.Although, it should be appreciated that neighborhood blocks havingdifferent sizes and shapes may be employed in the practice of thepresent invention and that the neighborhood block need not be centeredon the current tag.

After identification of the neighborhood block, module 54 analyzes thesegmentation tags within the neighborhood block and, based upon theanalysis, generates one or more neighborhood block tag predictions. Eachneighborhood block tag prediction identifies a segmentation tag value orvalues that, based upon an analysis of neighboring tags, could exist atthe current tag. Neighborhood block tag predictions can be based on anyanalysis of set of neighboring tags and can include factors such as thelocation of a segmentation tag within the neighborhood block withrespect to that of the current tag and whether a segmentation tag hasbeen cleaned.

Examples of possible neighborhood block predictions will be describedwith reference to FIG. 5 in which is shown a sample neighborhood block60 comprising a 5×5 block of segmentation tags centered upon current tag(x13). Assuming the block tag cleaner is stepping through segmentationtags along a path from top to bottom, such as is shown in FIG. 4, in apass from left to right tags x1 through x12 will have been cleaned. Onepossible analysis of the segmentation tags within the neighborhood blockto generate a neighborhood block tag prediction builds a frequency tablefor the segmentation tags within the block. A frequency table identifiesthe number of occurrences of each tag value within the block. Whengenerating a frequency table, the segmentation tags may be weightedbased upon their location, tag value and/or their status (i.e.,previously cleaned). For example, assuming the segmentation tags inneighborhood block 60 have the following values:

wherein the 25 segmentation tags can be identified x1, x2, . . . , x25and are positioned/oriented as shown in FIG. 5. Generating a frequencytable wherein cleaned tags are weighted 2 and the remaining tags areweighted 1 provides a frequency table of: [A:9, B:5, C:10, D:4, E:8,F:1]. Similarly, another weighting scheme may weight cleaned, adjacenttags 2.5, cleaned, nonadjacent tags 2, adjacent tags (not cleaned) 1.5and the remaining tags 1 to provide a frequency table of: [A:9.5, B:5.5,C:11, D:4.5, E:9.5, F:1]. Weighting a tag based upon its value might,for example, reduce the weight of a tag in half for specific imageclasses.

After generating the frequency table, any criteria may be used to selecta s neighborhood block tag prediction from the table. One criterion thatmay be used to select the block tag prediction is the most predominanttag in the table, resulting in a predicted tag value of C for bothweighting schemes. Another possible criterion may identify any tag valuehaving more than predetermined percent of the total weightedoccurrences. For example, in the first weighting scheme there are 34weighted occurrences. If the block tag prediction identifies those tagvalues having at least 25 percent of the weighted occurrences (that is,more than 8.5), the block tag prediction would identify tag values A andC as the neighborhood block tag prediction.

Similarly, transition analysis module 56 identifies a group ofsegmentation tags to generate a block of transitioning segmentation tags(transition block) having a predefined size, shape and location withrespect to the current tag. Module 56 analyzes the segmentation tagswithin the transition block and, based upon the analysis, generates oneor more transition block tag predictions for the current tag. Eachtransition block tag prediction identifies one or more predicted tagvalues for the current tag based on the presumption that the current tagis transitioning into or out of a different image region.

The size, shape and location of the transition block will generallydepend on the size, shape and location of the neighborhood block andwhether the transition block tag prediction identifies a transition intoor out of an image area. For example, if the transition block tagprediction is based upon a transition into an image region, thetransition block may include segmentation tags from the image regioninto which the current tag may be transitioning. One possible transitionblock 62, as it relates to the neighborhood block 60 of FIG. 5, is shownin FIG. 6. In FIG. 6, neighborhood block 60 is shown in dotted line andtransition block 62, identifying an area into which the current tag istransitioning, is shown comprising a 5×5 block of segmentation tags withcurrent tag x13 in the upper left corner.

The transition block tag prediction can be based upon any analysis ofthe tags within the transition block. In general, it has been found thatgenerating a transition block prediction based upon a frequency tablefor the segmentation tags within the block provides good results. Aswith the generation of a neighborhood block prediction, the segmentationtags may be weighted based upon their location relative to the currenttag, their value and/or their status.

The tag predictions from modules 54 and 56 are passed to tag cleaningmodule 58 which generates a cleaned current tag based upon the tagpredictions. The tag predictions are used primarily to confirm thecurrent tag value rather than to reset the current tag. Typically, thetag predictions will used to modify the current tag only if the currenttag does not match any of the predictions. In general, if any of theneighborhood block tag predictions are the same as the current tag, thecurrent tag is presumed correct and is left untouched. If the currenttag does not match any of the neighboring tag predictions, the currenttag is compared to the transition block tag prediction. If thetransition block tag prediction matches the current tag, the current tagis presumed to be transitioning into a different region and is leftuntouched. If current tag does not match any of the tag predictions, thecurrent tag may be misclassified and is replaced with tag based upon theneighborhood block tag prediction, the transition block tag prediction,and the current tag.

Block tag cleaner 50 can embody or be implemented using a specialpurpose computer, a programmed microprocessor or microcontroller andperipheral integrated circuit elements, an ASIC or other integratedcircuit, a digital signal processor, a hardwired electronic or logiccircuit such as a discrete element circuit, a programmable logic devicesuch as a PLD, PLA, FPGA or PAL, or the like. Furthermore, specificalgorithms may be accomplished using software in combination withspecific hardware. In general, any device capable of implementing afinite state machine that is capable of implementing the block tagcleaning process described can be used to realize block tag cleaner 50.

Having generally described an architecture for a block tag cleaner,attention is now turned to a discussion of an embodiment of a method forcleaning segmentation tags in accordance with the present invention.Referring now to FIG. 7, there is shown a schematic illustration ofvarious steps performed in cleaning segmentation tags in accordance withan embodiment of a block tag cleaner and an alternate representation ofthe operation and data flow through block tag cleaner 50 of FIG. 3.

In FIG. 7 step 70 receives segmentation tags and identifies a currenttag to be cleaned. Next, at step 72, one or more segmentation tagsneighboring the current tag are identified. The neighboring segmentationtags identified at step 72 along with the current tag comprise aneighborhood block. As previously described, the neighborhood blockbeneficially comprises a square block centered on the current tag. Afteridentifying the neighborhood block, the clean up operation for thecurrent tag begins.

Initially, at step 74 the current tag may be reset as a function of thesegmentation tags adjacent to the current tag. More specifically, for agiven set of segmentation tags, it may be advantageous to override thecurrent tag based upon the adjacent tags. For example, if the currenttag is represents an image class of intermediate frequency halftone, thecurrent tag may be set to represent a high frequency halftone if amajority of the adjacent tags also represent high frequency halftones.Similarly, a current tag is that represents an image class ofintermediate frequency halftone may be reset to represent a lowfrequency halftone if more adjacent tags represent low frequencyhalftones than represent high frequency halftones. In another example, atag representing an image class of edge may be reset to represent a lowfrequency halftone if one or more of the adjacent tags have a value thatrepresents low frequency halftone. It is appreciated that those skilledin the art will recognize that additional or alternative conditionsexist in which it may be desirable or advantageous to override thecurrent tag.

At step 76, the current tag is compared to one or more segmentation tagsadjacent to the current tag. A segmentation tag is adjacent to anotherwhen there are no other segmentation tags between them. If thesegmentation tags are rectangular and arranged in rows and columns, eachtag may have up to eight neighbors. Other criteria (e.g., cleanedadjacent, horizontal adjacent, cleaned, vertical adjacent) can be usedto reduce the number of segmentation tags to which the current tag iscompared. If the tag is the same as at least one of the adjacent tags towhich it is compared, then the current tag is presumed to be correct andthe cleanup operation for the current tag is completed. If the currenttag does not match any of the adjacent tags to which it is compared,then the cleanup operation continues at step 78.

In step 78 the current tag and the segmentation tags within theneighborhood block are analyzed to generate one or more neighborhoodblock tag predictions such as are described above. At step 80, thecurrent tag is compared to the neighborhood block tag prediction(s)generated at step 78. If the current tag is the same as the neighborhoodblock tag prediction, the current tag is presumed to be correct andprocessing for the current tag is completed. If the current tag is notthe same, then the cleanup operation continues at step 82.

At step 82, the neighborhood block tag prediction is compared to asegmentation tag value representing the document background or similarimage classification for the scanned document. A document backgroundclassification may be preselected for all scanned documents ordetermined for each document scanned by, for example, identifying thepredominate image class in the first few scanlines along the leadingedge of a scanned document. If the neighborhood block tag prediction isthe same as the document background, the total number of (weighted)occurrences of the current tag value within the neighborhood block iscompared to a threshold at step 84. If the number of (weighted)occurrences is greater than the threshold, it is presumed that thecurrent tag is transitioning from the background class, and cleanup ofthe current tag complete. The threshold can be set to any number ofoccurrences or a percent of total occurrences.

On the other hand, if either the neighborhood block tag prediction isnot the same as the background class or the number of (weighted)occurrences for that tag value is not greater than a threshold, theprocess continues with step 86. At step 86, a transition block isidentified and the segmentation tags within the transition block areanalyzed to generate one or more transition block tag predictions. Aftergenerating one or more transition block tag predictions as describedabove, the process compares the current tag to the transition block tagprediction at step 88. If the current tag is the same as the transitionblock tag prediction, the current tag is presumed to be transitioninginto a new image area and the processing of the current tag is complete.If the current tag is not the same, then the current tag may bemisclassified and the cleanup operation continues with steps 90 to 96wherein the current tag is replaced with tag based upon the neighborhoodblock tag prediction, the transition block tag prediction, and thecurrent tag.

At step 90, the neighborhood block tag prediction is compared to asegmentation tag value representing the document background. If theneighborhood block tag prediction matches a document background tagvalue at step 90, the process continues with step 92. In reaching step92, the current tag is presumed to be transitioning from a backgroundclassification. However, the current tag does not match the transitionblock tag prediction or have a great enough (weighted) frequency (step84) in the neighborhood block and thus is presumed to be tomisclassified. The current tag will be replaced with the transitionblock tag prediction if the transition prediction is a properreplacement.

At step 92, the process determines whether the transition block tagprediction can be used to replace the current tag. If so, at step 94,the current tag is replaced with the transition block tag prediction;otherwise, the current tag is untouched. More specifically, step 92applies a set of rules to determine if it is appropriate to replace thecurrent tag. The rules can be based upon a number of factors including,but not limited to, tag priority and tag frequency. As an illustrativeexample, a set of rules may indicate (1) that a transition block tagprediction having a value that represents an image class of backgroundor edge cannot be used to replace a current tag and (2) that atransition block tag prediction having any other value will replace thecurrent tag if the frequency of the current tag is below a firstthreshold and/or the frequency of the transition block tag prediction isabove a second threshold. It is appreciated that those skilled in theart will recognize that additional or alternative rules may be employedin determining whether a transition block tag prediction may replace thecurrent tag.

If the current tag is not equal to the transition block tag predictionat step 88 and the neighborhood block tag prediction does have not a tagvalue that represents the document background at step 90, the processgenerates a cleaned current tag based on the current tag, theneighborhood block tag prediction and the transition block tagprediction at step 96. One possible function sets the current tag toequal the neighborhood block tag prediction as long as the neighborhoodblock tag prediction does not equal a predetermined image class such asbackground or edge.

In general, when cleaning segmentation tags to reduce segmentationartifacts, the tag cleanup operation will beneficially clean eachsegmentation tag once. However, a multi-level cleanup operation can beperformed by passing cleaned tags through the cleanup operation severaltimes. Each successive cleanup operation could be performed following apath as shown in FIG. 4 to eliminate any bias due to unidirectionalcleanup. Additionally, it is understood that processing limitations mayrequire that only a subset of the segmentation tags be cleaned.

Referring now to FIG. 8 there is shown block diagram depicting the dataflow through a second embodiment of block tag cleaner 100 in accordancewith the present invention. In the embodiment of FIG. 8, segmentationtags are cleaned by block tag cleaner 100 using a statistical analysisof connected components. Block tag cleaner 100 can embody or beimplemented using a special purpose computer, a programmedmicroprocessor or microcontroller and peripheral integrated circuitelements, an ASIC or other integrated circuit, a digital signalprocessor, a hardwired electronic or logic circuit such as a discreteelement circuit, a programmable logic device such as a PLD, PLA, FPGA orPAL, or the like. Furthermore, specific algorithms may be accomplishedusing software in combination with specific hardware. In general, anydevice capable of implementing a finite state machine that is in turncapable of implementing the block tag cleaning process described belowcan be used to realize block tag cleaner 100.

In block tag cleaner 100, segmentation tags are coupled to tags analysismodule 102. Tag analysis module 102 receives a plurality of segmentationtags and identifies weakly connected segmentation tags within theplurality of tags. Tag analysis module 102 identifies weakly connectedsegmentation tags as those segmentation tags that are not the same as orare not similar to a sufficient number of adjacent segmentation tags.Additionally, module 102 may identify a particular tag as a weaklyconnected tag if the number of neighboring segmentation tags indicatinga predefined image type, such as background, exceeds a certainthreshold. After identifying a weakly connected tag, module 102eliminates the weakly connected tag from further processing by replacingthe tag value with a value indicating a pre-selected image type such asbackground. Alternatively, module 102 can eliminate a weakly connectedtag by marking the weakly connected tag in such a way that the tag canbe identified as being a weakly connected tag in a subsequent processingoperation.

After the weakly connected segmentation tags within the plurality oftags have been identified, connected component generator 104 identifiesthe connected components. A set of segmentation tags comprise a“connected component” if each segmentation tag within the set isadjacent to at least one segmentation tag that is in the set and if eachpair of segmentation tags in the set are connected by a subset of othertags in the set.

The process for identifying connected components within the plurality ofsegmentation tags can be described by way of example. Assuming module102 eliminates weakly connected segmentation tags by replacing such tagswith an image type of background, generator 104 simply locates anon-background segmentation tag as a first connected tag. Once aconnected (background) segmentation tag is found an iterative processlocates all the non-background segmentation tags adjacent to theconnected tag, and their adjacent connected tags, and so on, until theextent of the connected tags is determined. This process is repeateduntil all non-background segmentation tags have been properly associatedwith a connected component. Similarly, if module 102 marks asegmentation tag as being weakly connected, the process simplyidentifies an unmarked tag as a first connected tag and continues toidentify all the adjacent unmarked tags until the extent of theconnected component is known.

It should be noted that the possibility exists where generator 104identifies a connected component which contains a region comprising asmall number of weakly connected tags (e.g., background or marked)within the confines of the connected component. These regions will bemerged into the connected component if the size of the region issufficiently small. The determination of whether the size of a region issmall can be based on a number of factors including the number of weaklyconnected tags within the region, the percentage of the connectedcomponent comprised by the region, etc.

After identifying the connected components at generator 104, block tagcleaner 100 generates a representative tag for each connected componentbased upon collected statistics and a predefined set of heuristic rulesat modules 106 and 108. The generation of a representative tag for eachconnected component is similar to the generation of block level tags asdescribed above with reference to FIGS. 1 and 2. That is, the connectedcomponents identified at generator 104 are passed to statisticscollection module 106 wherein tag statistics for each connectedcomponent are collected. Module 106 can collect any desired statisticsfrom which a representative tag for the connected component can beidentified. Beneficially, module 106 collects tag statistics sufficientto identify the most predominant tag value and the second mostpredominant tag value within each connected component.

Using the collected tag statistics, tag generator 108 identifies arepresentative tag for each connected component. The representative taggenerated for each connected component identifies a segmentation tagvalue or values based upon the collected statistics and a predefined setof heuristic rules. One possible set of rules for generating arepresentative tag based upon the most predominant tag value and thesecond most predominant tag value was previously described withreference to FIG. 1. A representative tag could also be identified basedon the segmentation tag histogram distribution or some heuristic imagequality requirements such as masking segmentation defects. Aftergeneration of a representative tag for a connected component bygenerator 108, tag replacement module 110 replaces selected segmentationtags within the connected component with a cleaned segmentation taggenerated as a function of the representative tag and the value of theselected tag. One such function simply replaces each segmentation tagwithin the connected component with the representative tag.

Referring now to FIG. 9 there is shown a block diagram depicting thedata flow through an embodiment of a pixel tag cleaner in accordancewith the present invention. As stated above, the pixel tag cleaneroperates on pixel level segmentation tags to generate cleaned pixellevel segmentation tags based upon a window of neighboring segmentationtags. As shown in FIG. 9, pixel tag cleaner receives a current pixellevel segmentation tag to be cleaned at module 120. Next, at module 122,the pixel tag cleaner identifies a neighborhood window comprising agroup of segmentation tags neighboring the current pixel level tag.

The knowledge of the neighboring segmentation tags aids in making anintelligent decision regarding the value of a pixel level tag.Beneficially, the pixel tag cleaner bases the decision to modify a pixellevel tag on neighboring block level tags such as are available from ablock tag generator or a block tag cleaner. However, it is understoodthat the pixel tag cleaner may clean pixel level tags based upon awindow of neighboring pixel level segmentation tags. When identifying awindow of neighboring segmentation tags, module 122 beneficiallyidentifies a neighborhood window of segmentation tags centered on asegmentation tag associated with the current pixel level tag. When usinga neighborhood window comprising block level segmentation tags, thewindow is beneficially centered on a block in which the currentsegmentation tag resides.

After identification of the neighboring window, the pixel tag cleanercleans the current pixel level tag at module 124 to generate a cleanedpixel level tag. In general, if the neighborhood window comprises blocklevel segmentation tags, the current pixel level tag is compared to theblock level tag for the block in which the current pixel resides. If thecurrent pixel level tag is the same as the current block tag, the pixellevel tag is presumed to be correct and left untouched. If theneighborhood window comprises pixel level segmentation tags or, if thewindow comprises block level tags, the pixel level tag is not the sameas the current block tag, the current pixel level tag is compared tosegmentation tags comprising the neighborhood window. If the currentpixel level tag is the same as a threshold number of the neighboringsegmentation tags, the pixel level tag is presumed to be transitioningand, again, left untouched. If the pixel level tag is not the same aseither the current block tag or one of the neighboring segmentationtags, the current pixel level tag typically will be replaced with asegmentation tag generated as a function of the neighboring segmentationtags. When the neighborhood window comprises block level tags, thecurrent pixel level tag is typically replaced with the current block tagto generate the cleaned pixel level tag. However, it should beappreciated that in certain situations, it may not be desirable toreplace the current pixel level tag with the block level tag. Forexample, if the current block level tag identifies an image class ofbackground, it may not be desirable to replace the current pixel leveltag with a tag identifying an image class of background. Similarly, ifthe current block level tag identifies an image class of intermediate(or fuzzy) frequency halftone, it might not be desirable to replace acurrent pixel level tag of low or high frequency halftone.

One image class for which it may be desirable to provide an exception tothe general process outlined above is the edge class. That is, for pixellevel tags identifying an image class of edge, it is generally desirablefor the pixel level tag to have priority over the block level tags. Morespecifically, a pixel level tag identifying an edge class will notreplaced with a block level tag, except in the case of a block level tagof low frequency halftone which will replace a pixel level edge class.

The operation of module 124 will be illustrated with reference to thecleaning of pixel level tags using a 3×3 neighborhood window of blockscentered on a block in which the current pixel level tag resides. Theuse of a 3×3 neighborhood window is illustrated in FIG. 10. In FIG. 10,the current pixel level tag 130 is shown as residing in block 132,referred to as the current block, that is surrounded by eightneighboring (adjacent) blocks. Beneficially, each of the blocks withinthe neighborhood window have the same size and orientation.

After identifying the neighborhood window, the pixel tag cleaner cleansthe current pixel level tag. In cleaning pixel level tags, module 124initially analyzes the neighborhood block to generate “temporaryvariables” used in comparing the current pixel level tag to thesegmentation tags within the neighborhood window. These temporaryvariables may identify the frequency of each tag (image class) withinthe neighborhood window, whether any low frequency or high frequencyhalftones exist in the window or whether the neighborhood window hasmore high frequency or low frequency halftones.

The temporary variables will remain valid until the neighborhood windowchanges. That is, in operation the pixel tag cleaner retrieves a currentpixel level tag to be cleaned. For each new pixel level tag to becleaned, the pixel tag cleaner must identify a neighborhood window.Assuming that each block within the neighborhood window has a size ofM×N segmentation tags, the neighborhood window remains the same forevery M pixel level tags in the fastscan direction and N pixel tags in aslowscan direction.

After generating the temporary variables used in comparing the currentpixel level tag to the segmentation tags within the neighborhood window,module 124 generates a cleaned pixel level tag based upon a set ofpredefined rules. In most cases, if the pixel level tag is the same asthe current block tag or any of the eight neighboring block level tags,the tag is untouched. Otherwise, the current pixel level tag is replacedwith the current block tag unless the current block tag identifies animage class of background wherein the current pixel level tag willremain unchanged. An exception to this general rule occurs for pixellevel tags identifying an image class of edge which has a higherpriority than several block level tags.

Given a set of segmentation tags comprising one or more of the followingimage classes: smooth contone (Scontone), rough contone (Rcontone), lowfrequency halftone (Low Freq), fuzzy or intermediate low frequencyhalftone (Fuzzy Low), fuzzy or intermediate high frequency halftone(Fuzzy High), high frequency halftone (High Freq), text, background andtext on tint, the general predefined set of tag cleaning rules outlinedabove for generating a cleaned pixel level segmentation tag based upon awindow of neighboring block level tags can be described by the followingC-like programming statement:

if (freq[Low Freq]>0) LFHT=1

if (freq[High Freq]>0) HFHT=1

if (freq[Low Freq]>freq[High Freq]maxL=1

if (freq[High Freq]>0) and (freq[High Freq]>=freq[Low Freq])) maxH=1

If (CP=Edge)

{

}

Else if ((CP=Fuzzy High) OR (CP=Fuzzy Low))

{

}

Else if (CP=RContone)

{

}

Else if ((CP=Low Freq) and (CB=Background))

{

}

Else if ((freq[CP]>1) or (CB=Background)) OP=CP

/*if CP is in the neighboring blocks or CB is background, keep CP*/

Else OP=CB /* replace with current block tag */

wherein CP is the current pixel level tag, OP is the output (cleaned)pixel level tag; CB is the current block level tag; and freq[imageclass] computes the frequency (number of occurrences) of that imageclass in the block level segmentation tags within the neighborhoodwindow. It is understood that the above set of rules is provided by wayof example to illustrate the generation of a block level tag as afunction of one or more predominant tags, and one skilled in the art mayidentify different rules for generating a block level tag.

The tag pixel tag cleaner can embody or be implemented using a specialpurpose computer, a programmed microprocessor or microcontroller andperipheral integrated circuit elements, an ASIC or other integratedcircuit, a digital signal processor, a hardwired electronic or logiccircuit such as a discrete element circuit, a programmable logic devicesuch as a PLD, PLA, FPGA or PAL, or the like. Specific algorithms may beaccomplished using software in combination with specific hardware. Ingeneral, any device capable of implementing a finite state machine thatis capable of implementing the pixel tag cleaning process describedabove can be used to realize the pixel tag cleaner.

Having described each of the three segmentation tag processors (blocktag generator, block tag cleaner and pixel tag cleaner) used to processsegmentation tags, attention is now turned to a system for processingsegmentation tag to reduce segmentation artifacts. Referring to FIG. 11,there is shown a block diagram of an embodiment of an image processingsystem IPS 206 that includes system 150 for processing segmentation tagsthat makes use of all three segmentation tag processors.

In FIG. 11, image data such as RGB video from a color scanning device isreceived by IPS 206 at RGB-to-Neutral module 230. Module 230 convertsthe image data to a n-bit neutral channel video data in a known mannersuch as by performing a linear combination of the three channels:

Neutral (N)=rWt * RED+gWt * GREEN+bWt * BLUE

where rWt, gWt and bWt are red, green and blue weighting coefficientsrespectively. The neutral channel video data is passed to a segmentationmodule 232. Segmentation module 232 uses any automatic imagesegmentation technique to analyze the video data, classify image pixelsand generate pixel level segmentation tags 152 that identify pixel as aparticular image class.

Pixel level segmentation tags 152 are coupled to block tag generator154. Block tag generator 154 identifies a block of segmentation tags,compiles statistics for segmentation tags within the identified blockand generates a block level tag 156 for the identified block ofsegmentation tags based upon the compiled statistics. Block taggenerator passes the pixel level tags 152 to a tag buffer 158. Tagbuffer 158 provides intermediate storage of pixel level tags and can beaccomplished using a data compression operation such as LZ compressionand subsequent storage in Electronic PreCollation memory, high bandwidthmemory or similar operations.

Block level tags 156 from block tag generator 154 are passed to blocktag cleaner 160. Block tag cleaner 160 operates to clean tags 156 basedon a group of neighboring block level segmentation tags. Block tagcleaner can clean the block tags using morphological operations combinedwith heuristic rules or by statistically analyzing connected componentsof segmentation tags. Block tag cleaner provides cleaned block tags 162to pixel tag cleaner 164.

Pixel tag cleaner 164 receives pixel level tags 152 from buffer 158 andcleaned block level tags 162 from block tag cleaner 160. Based on aneighborhood window of block tags, the pixel level tags are cleaned togenerate cleaned pixel level tags 166. Cleaned pixel level tags 166 arepassed to post processing module 234 where the cleaned tags are used inpost-processing functions (e.g., filtering and rendering) on video imagedata received from pre-processing circuit 236 through video buffer 238.

As stated above, the system can comprise any combination of one or moreof the segmentation tag processors described above to reducesegmentation artifacts. For example system 150 can be modified toeliminate the block tag cleaner as is shown in FIG. 12. System 150′ ofFIG. 12 processes segmentation tags using two segmentation tagprocessors (block tag generator 154 and pixel tag cleaner 164) toprocess the segmentation tags. In system 150′ of FIG. 12, block taggenerator 154 generates block level tags 156 from pixel levelsegmentation tags 152 as described above and passes the pixel level tags152 to tag buffer 158. The block level tags 156 from block tag generator154 are passed to pixel tag cleaner 164. Pixel tag cleaner 164 generatesthe cleaned pixel level tags 166 in the same manner described aboveexcept that the neighborhood window of block tags are selected fromoriginal block level tags 156 rather than cleaned block level tags 162.

What has thus been described is a system and method for processingsegmentation tags. The present invention cleans segmentation tags bystatistically analyzing connected components of segmentation tags. Inone embodiment of the present invention, weakly connected segmentationtags are eliminated from a set of segmentation tags and connectedcomponents are identified from the remaining segmentation tags. Tagstatistics are collected for each of the connected components and arepresentative segmentation tag is assigned to each connected componentbased on the collected statistics and a set of predetermined rules.

The present invention has been described in detail above; however,various modifications can be implemented without departing from thescope of the present invention. Moreover, it is noted that the presentinvention has been described with reference to various embodimentsdisclosed herein, it is not to be confined to the details set forthabove, but it is intended to cover such modifications or changes as madewithin the scope of the attached claims.

What is claimed is:
 1. A method of cleaning segmentation tags,comprising: receiving segmentation tags; identifying a connectedcomponent within the received segmentation tags; and generating arepresentative tag for the connected component.
 2. The method of claim1, wherein the step of identifying a connected component comprises:locating a first connected segmentation tag within the receivedsegmentation tags; and identifying connected segmentation tags that areadjacent to the first connected segmentation tag.
 3. The method of claim2, wherein the step of identifying a connected component furthercomprises identifying weakly connected tags in the received segmentationtags.
 4. The method of claim 3, wherein the step of identifying weaklyconnected segmentation tags comprises: comparing a segmentation tag withneighboring segmentation tags; and eliminating the segmentation tag ifthe number of neighboring segmentation tags that represent a predefinedimage type exceeds a threshold.
 5. The method of claim 4, wherein theeliminating step replaces the segmentation tag with a pre-selected imagetype when the number of neighboring segmentation tags that represent apredefined image type exceeds a threshold.
 6. The method of claim 1,further comprising compiling a statistic for the segmentation tagswithin the connected component.
 7. The method of claim 6, wherein thestep of compiling a statistic comprises determining the most predominantsegmentation tag within the connected component.
 8. The method of claim7, wherein the step of compiling a statistic further comprisesdetermining the second most predominant segmentation tag within theconnected component.
 9. The method of claim 8, wherein the step ofcompiling a statistic further comprises modifying the most predominanttag in accordance with a set of predetermined rules.
 10. The method ofclaim 9, wherein the set of predetermined rules comprises modifying themost predominant segmentation tag to equal the second most predominantsegmentation tag when the most predominant tag indicates an image typeselected from a fuzzy low frequency halftone, a fuzzy high frequencyhalftone and a intermediate frequency halftone and the second mostpredominant pixel level segmentation tag indicates an image typeselected from high frequency halftone and low frequency halftone. 11.The method of claim 9 wherein the set of predetermined rules comprisesmodifying the most predominant segmentation tag to equal the second mostpredominant segmentation tag when the second most predominantsegmentation tag indicates an image type of background and the mostpredominant tag indicates an image type selected from contone and highfrequency halftone.
 12. The method of claim 9 wherein said set ofpredetermined rules comprises modifying the most predominantsegmentation tag to equal the second most predominant segmentation tagwhen the most predominant tag indicates an image type of contone and thesecond most predominant segmentation tag indicates an image type of lowfrequency halftone.
 13. The method of claim 1, further comprising:modifying selected segmentation tags within the connected componentbased on the representative tag.
 14. The method of claim 13, wherein thestep of modifying selected segmentation tags comprises replacing theselected segmentation tags with the representative tag.
 15. A system forprocessing segmentation tags, comprising: a tag analysis moduleconnected to receive segmentation tags and identify weakly connectedsegmentation tags within said received segmentation tags; a connectedcomponent generator identifying a connected component within thereceived segmentation tags; and a tag generation module generating arepresentative tag for the connected component.
 16. The system of claim15, further comprising: a statistics compilation module to compile aconnected component statistic for segmentation tags within the connectedcomponent; wherein the tag generation module generates therepresentative tag based upon the connected component statistic.
 17. Thesystem of claim 16, wherein the connected component statistic comprisesthe most predominant segmentation tag.
 18. The system of claim 15wherein the tag analysis module identifies a segmentation tag as weaklyconnected if the number of neighboring segmentation tags that representa predefined image type exceeds a threshold.
 19. The system of claim 15wherein the tag analysis module identifies a segmentation tag as weaklyconnected if the number different image types represented by theadjacent segmentation tags exceeds a threshold.
 20. The system of claim15 further comprising: a tag replacement module to replace selectedsegmentation tags within the connected component with a cleanedsegmentation tag generated as a function of the representative tag.